Forward and adjoint sensitivity analysis with continuous explicit Runge - Kutta methods ⋆

نویسندگان

  • Mihai Alexe
  • Adrian Sandu
چکیده

We study the numerical solution of tangent linear, first, and second order adjoint models with high-order explicit, continuous Runge-Kutta methods. The approaches currently implemented in popular packages such as SUNDIALS or DASPKADJOINT are based on linear multistep methods. For adaptive time integration of nonlinear models, interpolation of the forward model solution is required during the adjoint model simulation. We propose to use the dense output mechanism built in the continuous Runge-Kutta methods as a highly accurate and cost-efficient interpolation method in the inverse problem run. We implement our proposed approach in a Fortran library called DENSERKS, which is found to compare well to other similar software on a number of test problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer Science Technical Report TR - 07 - 34 October 6 , 2007 Mihai Alexe and Adrian Sandu DENSERKS : Fortran sensitivity solvers using continuous , explicit Runge - Kutta schemes

DENSERKS is a Fortran sensitivity equation solver package designed for integrating models whose evolution can be described by ordinary differential equations (ODEs). A salient feature of DENSERKS is its support for both forward and adjoint sensitivity analyses, with built-in integrators for both first and second order continuous adjoint models. The software implements explicit Runge-Kutta metho...

متن کامل

FATODE: A Library for Forward, Adjoint, and Tangent Linear Integration of ODEs

Fatode is a fortran library for the integration of ordinary differential equations with direct and adjoint sensitivity analysis capabilities. The paper describes the capabilities, implementation, code organization, and usage of this package. Fatode implements four families of methods – explicit Runge-Kutta for nonstiff problems and fully implicit Runge-Kutta, singly diagonally implicit Runge-Ku...

متن کامل

Forward, Tangent Linear, and Adjoint Runge Kutta Methods in KPP–2.2 for Efficient Chemical Kinetic Simulations

The Kinetic PreProcessor (KPP) is a widely used software environment which generates Fortran90, Fortran77, Matlab, or C code for the simulation of chemical kinetic systems. High computational efficiency is attained by exploiting the sparsity pattern of the Jacobian and Hessian. In this paper we report on the implementation of two new families of stiff numerical integrators in the new version 2....

متن کامل

Implicit-Explicit Runge-Kutta Schemes for Numerical Discretization of Optimal Control Problems

Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the numerical treatment of differential systems governed by stiff and non-stiff terms. This paper discusses order conditions and symplecticity properties of a class of IMEX Runge–Kutta methods in the context of optimal control problems. The analysis of the schemes is based on the continuous optimality system. Using suitable trans...

متن کامل

Forward, tangent linear, and adjoint Runge-Kutta methods for stiff chemical kinetic simulations

This paper investigates numerical methods for direct decoupled sensitivity and discrete adjoint sensitivity analysis of stiff systems based on implicit Runge Kutta schemes. Efficient implementations of tangent linear and adjoint schemes are discussed for two families of methods: fully implicit three-stage Runge Kutta and singly diagonally-implicit Runge Kutta. High computational efficiency is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008